Optimized transmission coordination mechanisms for opportunistic routing

The successful rate of transmission coordination of opportunistic routing (OR) is analyzed systematically,and then two efficient transmission coordination mechanisms (TCMs) are proposed for OR:a batch sliding window-based TCM and a bit map-based TCM,to reduce the total number of packet transmissions and improve end-to-end throughput for OR.The batch sliding window-based TCM avoids the oscillation of the successful rate of transmission coordination by transmitting packets in continuous batch mode so as to improve the average successful rate of transmission coordination efficiently,while the bit map-based TCM improves end-to-end throughput of OR by reducing the overhead of transmission coordination.Exhaustive simulations show that the average end-to-end throughput gains of the two proposed TCMs are 15.4％ and 6.4％ over the batch map-based TCM,respectively.     

Experimental Analysis of Link Estimation Methods in Low Power Wireless Networks

Wireless sensor networks are envisioned to be an integral part of cyber-physical systems,yet wireless networks are inherently dynamic and come with various uncertainties.One such uncertainty is wireless communication itself which assumes complex spatial and temporal dynamics.For dependable and predictable performance,therefore,link estimation has become a basic element of wireless network routing.Several approaches using broadcast beacons and/or unicast MAC feedback have been proposed in the past years,but ...     

分离机制下一种互联网安全接入方法

重点研究身份与位置分离机制下源地址真实性保障方面的方法,提出了身份与位置分离网络中唯一且不变的终端身份标识EID结构,并设计了一种保障源地址真实性的安全接入方法,并且给出了相应的协议流程和协议格式,保证了身份与位置分离网络中源地址即终端身份标识EID的真实性.最后使用SVO形式化逻辑对其安全性进行了证明.     

乘性单调张成方案的构造

乘性单调张成方案是实现安全多方计算的重要工具．构造乘性的单调张成方案对安全多方计算至关重要．对任意的存取结构，CRAMER等给出了一种构造方法，但构造出来的乘性单调张成方案的行规模变成原来的两倍，而列规模也增加了．文章提出一种新的构造方法，在不改变列规模的前提下，该方法可以构造出行规模小于原来的2倍的乘性单调张成方案．     

Anonymous multipath routing protocol based on secret sharing in mobile ad hoc networks

Because the intrinsic characteristics of mobile ad hoc networks(MANETs) cause several vulnerabilities,anonymous routing protocols attract much more attention in secure mobile ad hoc networks for the purposes of security and privacy concerns.Until recently,lots of anonymous routing protocols have been proposed.However,most of them are single path or use one path at a time,and the multipath schemes can not thwart both the passive attacks and active attacks simultaneously.Thus an anonymous multipath routing protocol based on secret sharing is proposed.The protocol provides identity anonymity,location anonymity,data and traffic anonymity by employing cryptograph technology and secret sharing in MANET communication process.Meanwhile,a hash function is introduced to detect active attacks in the data transmission process.The protocol can effectively thwart various passive attacks and reduce the successful probability of active attacks(such as interception and physical destroy attacks).Simulation results show that the proposed scheme provides a reasonably good level of network security and performance.     

策略路由在多网络多出口校园网中的应用

针对校园网中存在的多网络（不同校区）多出口的现象,采用策略路由的方式实现校园网的负载均衡,在实施过程中碰到DNS不能使用的问题,后经过分析,通过修改策略路由得以解决。     

适用于数字对象的保密比较协议

分析了现有保密比较协议无法使用于不确定数字对象比较的原因,用随机构造单向散列函数的方法设计了对不确定具体范围的数字对象进行比较的一种多方保密计算方案,协议能以零泄漏的方式快速比较两个数字对象是否相同.用广泛接受的模拟范例证明了方案的保密性.     

基于预知信息的占线Nomadic TSP问题

自然灾害的频繁发生使得应急减灾倍受关注, 尤其有效的应急救援车辆调度对应急减灾非常重要. 针对受灾点被提前获知但是不能立即接受救援服务的情形, 通过将受灾点(需求)的揭露时间和释放时间引入Nomadic TSP模型中构建了预知信息的占线Nomadic TSP问题, 并分别给出了问题的下界, 直线网络结构下的ENO-dd算法, 和一般网络结构下的GTR-dd算法, 并对算法进行了竞争性能分析. 结果表明两个算法随着预知信息的增多会有明显改进. 更为一般的预知信息结构以及最优的算法设计是下一步研究的方向.     

两种带多约束的组播路由算法

组播对其成员节点能够提供服务质量,且组播在未来通信网络当中起到越来越重要的角色.对多约束斯坦利最小树问题,提出了基于Boruvka方法的多约束组播算法(BMCMRA)与基于Kruskal方法的多约束组播算法(KMCMRA).仿真试验表明算法具有良好代价性能,且能够很好地满足多约束条件.     

借记卡安全电子支付的身份认证协议研究

为了加强借记卡处理安全电子交易（SET）协议的身份认证，在SET支付协议的基础上，提出了两种对借记卡身份进行认证的协议，使借记卡可以进行SET支付，第一种协议是在SET协议中增加个人密码的加密传输，第二种协议是采用服务器钱包模型，由服务器钱包对借记卡进行身份认证和余额检查，这两种协议可适应不同情况，较好地解决了SET协议对借记卡的支持。